Engineering bacteria to solve the Burnt Pancake Problem
نویسندگان
چکیده
منابع مشابه
Engineering bacteria to solve the Burnt Pancake Problem
BACKGROUND We investigated the possibility of executing DNA-based computation in living cells by engineering Escherichia coli to address a classic mathematical puzzle called the Burnt Pancake Problem (BPP). The BPP is solved by sorting a stack of distinct objects (pancakes) into proper order and orientation using the minimum number of manipulations. Each manipulation reverses the order and orie...
متن کاملNode-to-Set Disjoint Paths Problem in Burnt Pancake Graphs
A burnt pancake graph is a variant of Cayley graphs and its topology is suitable for massively parallel systems. However, for a burnt pancake graph, there is much room for further research. Hence, in this study, we focus on n-burnt pancake graphs and propose an algorithm to obtain n disjoint paths from a source node to n destination nodes in polynomial order time of n, n being the degree of the...
متن کاملStrong matching preclusion of burnt pancake graphs
The strong matching preclusion number of a graph is the minimum number of vertices and edges whose deletion results in a graph that has neither perfect matchings nor almost-perfect matchings. This is an extension of the matching preclusion problem that was introduced by Park and Ihm. The burnt pancake graph is a more complex variant of the pancake graph. In this talk, we examine the properties ...
متن کاملFault-tolerant routing in burnt pancake graphs
Recently, researches of parallel distributed computation are getting more important. Especially, massively parallel systems are studied with enthusiasm, and many topologies have been proposed. Since multiple faulty elements are expected in a massively parallel system, fault-tolerant routing is also studied eagerly for communication avoiding the faulty elements [4,6,8]. In this study, we focus o...
متن کاملThe Spanning Connectivity of the Burnt Pancake Graphs
Let u and v be any two distinct vertices of an undirected graph G, which is k-connected. For 1 ≤ w ≤ k, a w-container C(u, v) of a k-connected graph G is a set of w-disjoint paths joining u and v. A wcontainer C(u, v) of G is a w∗-container if it contains all the vertices of G. A graph G is w∗-connected if there exists a w∗-container between any two distinct vertices. Let κ(G) be the connectivi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Biological Engineering
سال: 2008
ISSN: 1754-1611
DOI: 10.1186/1754-1611-2-8